Approximate Strategyproofness
نویسندگان
چکیده
The standard approach of mechanism design theory insists on equilibrium behavior by participants. This assumption is captured by imposing incentive constraints on the design space. But in bridging from theory to practice, it often becomes necessary to relax incentive constraints in order to allow tradeo↵s with other desirable properties. This paper surveys a number of different options that can be adopted in relaxing incentive constraints, providing a current view of the state-of-the-art.
منابع مشابه
The Efficient Frontier in Randomized Social Choice
Since the celebrated Gibbard-Satterthwaite impossibility results and Gibbard’s 1977 extension for randomized rules, it is known that strategyproofness imposes severe restrictions on the design of social choice rules. In this paper, we employ approximate strategyproofness and the notion of score deficit to study the possible and necessary trade-offs between strategyproofness and efficiency in th...
متن کاملLocal Sufficiency for Partial Strategyproofness∗
In (Mennle and Seuken, 2017), we have introduced partial strategyproofness, a new, relaxed notion of strategyproofness, to study the incentive properties of nonstrategyproof assignment mechanisms. In this paper, we present results pertaining to local sufficiency for partial strategyproofness: We show that, for any r P r0, 1s, r-local partial strategyproofness implies r2-partial strategyproofnes...
متن کاملPartial Strategyproofness: An Axiomatic Approach to Relaxing Strategyproofness for Assignment Mechanisms
We present partial strategyproofness, a new, relaxed notion of strategyproofness to study the incentive properties of non-strategyproof assignment mechanisms. Under partially strategyproof mechanisms, truthful reporting is a dominant strategy for agents who have sufficiently different valuations for different objects. A single numerical parameter, the degree of strategyproofness, controls the e...
متن کاملPartial Strategyproofness: An Axiomatic Approach to Relaxing Strategyproofness for Random Assignment Mechanisms
In this paper, we present a new relaxed notion of strategyproofness to study the incentive properties of non-strategyproof random assignment mechanisms. To this end, we first prove a new decomposition of full strategyproofness into three axioms: swap monotonicity, upper invariance, and lower invariance. By dropping the lower invariance axiom we obtain partially strategyproof mechanisms, which r...
متن کاملOn the Incompatibility of Efficiency and Strategyproofness in Randomized Social Choice
Efficiency—no agent can be made better off without making another one worse off—and strategyproofness—no agent can obtain a more preferred outcome by misrepresenting his preferences—are two cornerstones of economics and ubiquitous in important areas such as voting, auctions, or matching markets. Within the context of random assignment, Bogomolnaia and Moulin have shown that two particular notio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012